<HTML><HEAD><TITLE>graph_adjacent_edge(+Graph, +Node, ?Edge)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_adjacent_edge(+Graph, +Node, ?Edge)</H1>
Succeeds if Edge is an edge adjacent to Node in Graph
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>Node</EM></DT>
<DD>an integer node number
</DD>
<DT><EM>Edge</EM></DT>
<DD>an e/3 edge structure
</DD>
</DL>
<H2>Description</H2>
<P>
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>graph_adjacent_edge(+, +, ?) is nondet
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/graph_edge-2.html">graph_edge / 2</A>, <A HREF="../../lib/graph_algorithms/graph_get_adjacent_edges-3.html">graph_get_adjacent_edges / 3</A>
</BODY></HTML>
